The partition dimension of strong product graphs and Cartesian product graphs
نویسندگان
چکیده
منابع مشابه
On the Partition Dimension of Cartesian Product Graphs
Let G = (V, E) be a connected graph. The distance between two vertices u, v 2 V, denoted by d(u, v), is the length of a shortest u À v path in G. The distance between a vertex v 2 V and a pd(G), is the minimum number of sets in any resolving partition of G. In this article we study the partition dimension of Cartesian product graphs. More precisely, we show that for all pairs of connected graph...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملSecret Sharing Based On Cartesian product Of Graphs
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...
متن کاملGeneralized Degree Distance of Strong Product of Graphs
In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...
متن کاملConnectivity of Cartesian product graphs
Use vi , i , i , i to denote order, connectivity, edge-connectivity and minimum degree of a graphGi for i=1, 2, respectively. For the connectivity and the edge-connectivity of the Cartesian product graph, up to now, the best results are (G1×G2) 1+ 2 and (G1×G2) 1+ 2. This paper improves these results by proving that (G1×G2) min{ 1+ 2, 2+ 1} and (G1×G2)= min{ 1+ 2, 1v2, 2v1} ifG1 andG2 are conne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.04.026